Exponentially small bounds on the expected optimum of the partition and subset sum problems
نویسنده
چکیده
منابع مشابه
Exponentially Small Bounds on the Expected Optimum
In this paper we are interested in behavior of this problem when the xi are i.i.d. random variables. Under fairly general conditions, the median of the solution for the subset sum problem has been shown to be exponentially small when t is near E [∑n i=1 xi ] [Luek82]; this result has found application in the probabilistic analysis of approximation algorithms for the 0-1 Knapsack problem [Luek82...
متن کاملScenario Set Partition Dual Bounds for Multistage Stochastic Programming: A Hierarchy of Bounds and a Partition Sampling Approach
We consider multistage stochastic programming problems in which the random parameters have finite support, leading to optimization over a finite scenario set. We propose a hierarchy of bounds based on partitions of the scenario set into subsets of (nearly) equal cardinality. These expected partition (EP) bounds coincide with EGSO bounds provided by Sandıkçı et al. (2013) in the case that the su...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملAn efficient numerical method for singularly perturbed second order ordinary differential equation
In this paper an exponentially fitted finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer. A fitting factor is introduced and the model equation is discretized by a finite difference scheme on an uniform mesh. Thomas algorithm is used to solve the tri-diagonal system. The stability of the algorithm is investigated. It ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 12 شماره
صفحات -
تاریخ انتشار 1998